327,050 research outputs found

    The Flattening of Globular Clusters

    Full text link
    In the three nearest luminous galaxies, the Milky Way System, the Andromeda Galaxy and NGC 5128 the brightest globular clusters are rounder than the faintest ones. On the other hand (contrary to some previous results) the flattening of individual LMC clusters is found to be independent of their luminosities. This suggests the possibility that the relationship between the flattening and luminosity of clusters might depend on host galaxy luminosity. No significant differences are found between the intrinsic flattening distributions of Galactic old halo, Galactic young halo and Galactic bulge/disk clusters. Such a dependence might perhaps have been expected if tidal forces (which are largest at small Galactocentric distances) removed angular momentum from globular clusters. The preliminary conclusion by Norris that clusters with blue horizontal branches are more flattened than red HB clusters is not confirmed by the larger data base that is now available. In other words there is no evidence for the puzzling claimed correlation between the flattening and the horizontal branch morphology of Galactic globular clusters.Comment: 20 pages text + tables; 5 postscript figures. Astronomical Journal, in pres

    Static Analysis of Functional Programs

    Get PDF
    In this paper, the static analysis of programs in the functional programming language Miranda* is described based on two graph models. A new control-flow graph model of Miranda definitions is presented, and a model with four classes of callgraphs. Standard software metrics are applicable to these models. A Miranda front end for Prometrix, Âż, a tool for the automated analysis of flowgraphs and callgraphs, has been developed. This front end produces the flowgraph and callgraph representations of Miranda programs. Some features of the metric analyser are illustrated with an example program. The tool provides a promising access to standard metrics on functional programs

    Validation in the Software Metric Development Process

    Get PDF
    In this paper the validation of software metrics will be examined. Two approaches will be combined: representational measurement theory and a validation network scheme. The development process of a software metric will be described, together with validities for the three phases of the metric development process. Representation axioms from measurement theory are used both for the formal and empirical validation. The differentiation of validities according to these phases unifies several validation approaches found in the software metric's literature

    Programmers' performance on structured versus nonstructured function definitions

    Get PDF
    A control-flow model for functional programs is used in an experimental comparison of the performance of programmers on structured versus nonstructured Miranda function definitions. The performance is taken as a measure of the comprehensibility of functional programs. The experimental set-up is similar to the Scanlan study (1989). However, in the present study, a two-factor repeated measures design is used in the statistical analysis. The control-flow model appears to be useful in the shaping of the experiment. A significantly better performance has been found for structured function definitions on both dependent variables: the time needed to answer questions about the function definitions and the proportion correct answers. Moreover, for structured function definitions, a counter-intuitive result has been obtained: there are significantly fewer errors in larger definitions than in smaller ones

    Axiomatic Testing of Structure Metrics

    Get PDF
    Axiomatic testing of software metrics is described, based on axioms from representational measurement theory. In a case study, the axioms are given for the formal relational structure and the empirical relational structure. Two approaches to axiomatic testing are elaborated: deterministic testing and probabilistic testin

    Classifications of the Host Galaxies of Supernovae, Set II

    Full text link
    Classifications on the DDO system are given for an additional 231 host galaxies of supernovae that have been discovered during the course of the Lick Observatory Supernova Search with the Katzman Automatic Imaging Telescope (KAIT). This brings the total number of hosts of supernovae discovered (or independently rediscovered) by KAIT, which have so far been classified on a homogeneous system, to 408. The probability that SNe Ia and SNe II have a different distribution of host galaxy Hubble types is found to be 99.7%. A significant difference is also found between the distributions of the host galaxies of SNe Ia and of SNe Ibc (defined here to include SNe Ib, Ib/c, and Ic). However, no significant difference is detected between the frequency distributions of the host galaxies of SNe II and SNe IIn. This suggests that SNe IIn are generally not SNe Ia embedded in circumstellar material that are masquerading as SNe II. Furthermore, no significant difference is found between the distribution of the Hubble types of the hosts of SNe Ibc and of SNe II. Additionally, SNe II-P and SNe II-L are found to occur among similar stellar populations. The ratio of the number of SNe Ia-pec to normal SNe Ia appears to be higher in early-type galaxies than it is in galaxies of later morphological types. This suggests that the ancestors of SNe Ia-pec may differ systematically in age or composition from the progenitors of normal SNe Ia. Unexpectedly, five SNe of Types Ib/c, II, and IIn (all of which are thought to have massive progenitors) are found in host galaxies that are nominally classified as types E and S0. However, in each case the galaxy classification is uncertain, or newly inspected images show evidence suggesting a later classification (abridged) ...Comment: Accepted for publishing in PAS

    Modeling the object-oriented software process: OPEN and the unified process

    Get PDF
    A short introduction to software process modeling is presented, particularly object-oriented modeling. Two major industrial process models are discussed: the OPEN model and the Unified Process model. In more detail, the quality assurance in the Unified Process tool (formally called Objectory) is reviewed

    Orbital-Peierls State in NaTiSi2O6

    Full text link
    Does the quasi one-dimensional titanium pyroxene NaTiSi2O6 exhibit the novel {\it orbital-Peierls} state? We calculate its groundstate properties by three methods: Monte Carlo simulations, a spin-orbital decoupling scheme and a mapping onto a classical model. The results show univocally that for the spin and orbital ordering to occur at the same temperature --an experimental observation-- the crystal field needs to be small and the orbitals are active. We also find that quantum fluctuations in the spin-orbital sector drive the transition, explaining why canonical bandstructure methods fail to find it. The conclusion that NaTiSi2O6 shows an orbital-Peierls transition is therefore inevitable.Comment: 4 pages, 3 figure

    Competitive exception learning using fuzzy frequency distributions

    Get PDF
    A competitive exception learning algorithm for finding a non-linear mapping is proposed which puts the emphasis on the discovery of the important exceptions rather than the main rules. To do so,we first cluster the output space using a competitive fuzzy clustering algorithm and derive a fuzzy frequency distribution describing the general, average system's output behavior. Next, we look for a fuzzy partitioning of the input space in such away that the corresponding fuzzy output frequency distributions `deviate at most' from the average one as found in the first step. In this way, the most important `exceptional regions' in the input-output relation are determined. Using the joint input-output fuzzy frequency distributions, the complete input-output function as extracted from the data, can be expressed mathematically. In addition, the exceptions encountered can be collected and described as a set of fuzzy if-then-else-rules. Besides presenting a theoretical description of the new exception learning algorithm, we report on the outcomes of certain practical simulations.competitive learning;exception learning;fuzzy pattern recognition
    • …
    corecore